On the Public Key Cryptosystems over Class Semigroups of Imaginary Quadratic Non-maximal Orders

نویسندگان

  • Yongtae Kim
  • Chang Han Kim
چکیده

In this paper we will propose the methods for finding the non-invertible ideals corresponding to non-primitive quadratic forms and clarify the structures of class semigroups of imaginary quadratic orders which were given by Zanardo and Zannier [8], and we will give a general algorithm for calculating power of ideals/classes via the Dirichlet composition of quadratic forms which is applicable to cryptography in the class semigroup of imaginary quadratic non-maximal order and revisit the cryptosystem of Kim and Moon [5] using a Zanardo and Zannier [8]’s quantity as their secret key, in order to analyze Jacobson [7]’s revised cryptosystem based on the class semigroup which is an alternative of Kim and Moon [5]’s.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A survey of cryptosystems based on imaginary quadratic orders

Since nobody can guarantee that popular public key cryptosystems based on factoring or the computation of discrete logarithms in some group will stay secure forever, it is important to study different primitives and groups which may be utilized if a popular class of cryptosystems gets broken. A promising candidate for a group in which the DL-problem seems to be hard is the class group Cl(∆) of ...

متن کامل

Towards Practical Non-interactive Public Key Cryptosystems Using Non-maximal Imaginary Quadratic Orders

We present a new non-interactive public-key distribution system based on the class group of a non-maximal imaginary quadratic order ClðDpÞ. The main advantage of our system over earlier proposals based on ðZ=nZÞ [25,27] is that embedding id information into group elements in a cyclic subgroup of the class group is easy (straight-forward embedding into prime ideals suffices) and secure, since th...

متن کامل

Reducing Logarithms in Totally Non-maximal Imaginary Quadratic Orders to Logarithms in Finite Fields

Since nobody can guarantee that the computation of discrete logarithms in elliptic curves or IF p remains intractible for the future it is important to study cryptosystems based on alternative groups. A promising candidate, which was proposed by Buch-mann and Williams 8], is the class group C l(() of an imaginary quadratic order O. This ring is isomorphic to the endomorphism ring of a non-super...

متن کامل

A Cryptosystem Based on Non-maximal Imaginary Quadratic Orders with Fast Decryption

We introduce a new cryptosystem with trapdoor decryption based on the di culty of computing discrete logarithms in the class group of the non maximal imaginary quadratic order O q where q q square free and q prime The trapdoor information is the conductor q Knowledge of this trapdoor information enables one to switch to and from the class group of the maximal order O where the representa tives ...

متن کامل

An Adaptation of the NICE Cryptosystem to Real Quadratic Orders

Security of electronic data has become indispensable to today’s global information society, and public-key cryptography, a key element to securing internet communication, has gained increasing interest as a vital subject of research. Numerous public-key cryptosystems have been proposed that use allegedly intractable number theoretic problems as a basis of their security. One example is NICE, in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006